Can anyone explain segmented sieve of eratosthenes [on hold]

Posted by Utkarsh on Programmers See other posts from Programmers or by Utkarsh
Published on 2014-08-20T13:11:07Z Indexed on 2014/08/20 16:34 UTC
Read the original article Hit count: 230

Filed under:

I've searched all over the web on implementation of segmented sieve of eratosthenes. But I found none of them suitable for a beginner. Can anyone explain me the underlying principle behind this method?

EDIT: I know that in Sieve of Eratosthenes, we find all primes upto the square root of given number and cross out all multiples of them till the given number. But what do we exactly do in its segmented version?

© Programmers or respective owner

Related posts about c++